Sparse two-dimensional local discriminant projections for feature extraction

نویسندگان

  • Zhihui Lai
  • Minghua Wan
  • Zhong Jin
  • Jian Yang
چکیده

Two-dimensional local graph embedding discriminant analysis (2DLGEDA) and two-dimensional discriminant locality preserving projections (2DDLPP) were recently proposed to directly extract features form 2D face matrices to improve the performance of two-dimensional locality preserving projections (2DLPP). But all of them require a high computational cost and the learned transform matrices lack dimensional locality discriminant projections (S2DLDP), which is a sparse extension of graph-based image feature extraction method. S2DLDP combines the spectral analysis and L1-norm regression using the Elastic Net to learn the sparse projections. Differing from the existing 2D methods such as 2DLPP, 2DDLP and 2DLGEDA, S2DLDP can learn the sparse 2D face profile subspaces (also called sparsefaces), which give an intuitive, semantic and interpretable feature subspace for face representation.Wepoint out that using S2DLDP for face feature extraction is, in essence, to project the 2D face images on the semantic face profile subspaces, onwhich face recognition is also performed. Experiments on Yale, ORL and AR face databases show the efficiency and effectiveness of S2DLDP. & 2010 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Local Discriminant Projections for Face Feature Extraction

One of the major disadvantages of the linear dimensionality reduction algorithms, such as Principle Component Analysis (PCA) and Linear Discriminant Analysis (LDA), are that the projections are linear combination of all the original features or variables and all weights in the linear combination known as loadings are typically non-zero. Thus, they lack physical interpretation in many applicatio...

متن کامل

Supervised Feature Extraction of Face Images for Improvement of Recognition Accuracy

Dimensionality reduction methods transform or select a low dimensional feature space to efficiently represent the original high dimensional feature space of data. Feature reduction techniques are an important step in many pattern recognition problems in different fields especially in analyzing of high dimensional data. Hyperspectral images are acquired by remote sensors and human face images ar...

متن کامل

A General and Unifying Framework for Feature Construction, in Image-Based Pattern Classification

This paper presents a general and unifying optimization framework for the problem of feature extraction and reduction for high-dimensional pattern classification of medical images. Feature extraction is often an ad hoc and case-specific task. Herein, we formulate it as a problem of sparse decomposition of images into a basis that is desired to possess several properties: 1) Sparsity and local s...

متن کامل

Gabor Based Optimized Discriminant Locality Preserving Projection for Feature Extraction and Recognition

This paper proposed a Gabor based optimized discriminant locality preserving projections (ODLPP) algorithm which can directly optimize discriminant locality preserving criterion on high-dimensional Gabor feature space via simultaneous diagonalization, without any dimensionality reduction preprocessing. Experimental results conducted on the VALID face database indicate the effectiveness of the p...

متن کامل

Orthogonal Tensor Sparse Neighborhood Preserving Embedding for Two-dimensional Image

Orthogonal Tensor Neighborhood Preserving Embedding (OTNPE) is an efficient dimensionality reduction algorithm for two-dimensional images. However, insufficiencies of the robustness performance and deficiencies of supervised discriminant information are remained. Motivated by the sparse learning, an algorithm called Orthogonal Tensor Sparse Neighborhood Embedding (OTSNPE) for two-dimensional im...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 74  شماره 

صفحات  -

تاریخ انتشار 2011